Average distance and maximum induced forest
نویسندگان
چکیده
منابع مشابه
A Note on a Conjecture of Hansen Et Al
Conjecture number 747 of Graffiti (circa 1992) states that the average distance of a simple, connected graph is not more than half the maximum order of an induced bipartite subgraph. Recently, P. Hansen et al. settled this conjecture by showing that the average distance is not more than half the maximum order of an induced forest. Moreover, they conjectured that the average distance is not more...
متن کاملDetermining Effective Factors on Forest Fire Using the Compound of Multivariate Adaptive Regression Spline and Genetic Algorithm, a Case Study: Golestan, Iran
Determining Effective Factors on Forest Fire Using the Compound of Multivariate Adaptive Regression Spline and Genetic Algorithm, a Case Study: Golestan, Iran Pahlavani, P., Assistant professor at School of Surveying and Geospatial Engineering, College of Engineering, University of Tehran Raei, A., PhD Candidate of GIS at School of Surveying and Geospatial Engineering, College of Engineeri...
متن کاملDetermining Effective Factors on Forest Fire Using the Compound of Multivariate Adaptive Regression Spline and Genetic Algorithm, a Case Study: Golestan, Iran
Determining Effective Factors on Forest Fire Using the Compound of Multivariate Adaptive Regression Spline and Genetic Algorithm, a Case Study: Golestan, Iran Pahlavani, P., Assistant professor at School of Surveying and Geospatial Engineering, College of Engineering, University of Tehran Raei, A., PhD Candidate of GIS at School of Surveying and Geospatial Engineering, College of Engineeri...
متن کاملThe prediction of Persian Squirrel Distribution Using a Combined Modeling Approach in the Forest Landscapes of Luristan Province
Habitat destruction is the most important factor determining species extinction; hence, the management of wildlife populations necessitates the management of habitats. Habitat suitability modeling is one of the best tools used for habitat management. There are several methods for habitat suitability modeling, with each of having some different advantages and disadvantages. In this study, we us...
متن کاملk-forested choosability of graphs with bounded maximum average degree
A proper vertex coloring of a simple graph is $k$-forested if the graph induced by the vertices of any two color classes is a forest with maximum degree less than $k$. A graph is $k$-forested $q$-choosable if for a given list of $q$ colors associated with each vertex $v$, there exists a $k$-forested coloring of $G$ such that each vertex receives a color from its own list. In this paper, we prov...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Journal of Graph Theory
دوره 60 شماره
صفحات -
تاریخ انتشار 2009